Termination w.r.t. Q proof of TRS/nontermin/CSREx4_7_77

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

zeros -> cons₂(0, zeros)
tail₁(cons₂(X, XS)) -> XS

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

zeros -> cons₂(0, zeros)
tail₁(cons₂(X, XS)) -> XS

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ZEROS -> ZEROS

The TRS R consists of the following rules:

zeros -> cons₂(0, zeros)
tail₁(cons₂(X, XS)) -> XS

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ZEROS -> ZEROS

The TRS R consists of the following rules:

zeros -> cons₂(0, zeros)
tail₁(cons₂(X, XS)) -> XS

Q is empty.
We have to consider all minimal (P,Q,R)-chains.